- defining polynomial
- мат.определяющий многочлен
English-Russian scientific dictionary. 2008.
defining polynomial
Смотреть что такое "defining polynomial" в других словарях:
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… … Wikipedia
Lagrange polynomial — In numerical analysis, a Lagrange polynomial, named after Joseph Louis Lagrange, is the interpolation polynomial for a given set of data points in the Lagrange form. It was first discovered by Edward Waring in 1779 and later rediscovered by… … Wikipedia
Equations defining abelian varieties — In mathematics, the concept of abelian variety is the higher dimensional generalization of the elliptic curve. The equations defining abelian varieties are a topic of study because every abelian variety is a projective variety. In dimension d ge; … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
FP (complexity) — In computational complexity theory, the complexity class FP is the set of function problems which can be solved by a deterministic Turing machine in polynomial time; it is the function problem version of the decision problem class P. Roughly… … Wikipedia
Perrin number — In mathematics, the Perrin numbers are defined by the recurrence relation: P (0) = 3, P (1) = 0, P (2) = 2, and : P ( n ) = P ( n − 2) + P ( n − 3) for n > 2.The series begins:3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, 22, 29, 39 ... OEIS|id=A001608The… … Wikipedia
Chomsky–Schützenberger theorem — In formal language theory, the Chomsky–Schützenberger theorem is a statement about the number of words of a given length generated by an unambiguous context free grammar. The theorem provides an unexpected link between the theory of formal… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
